Complexity of the Transshipment Problem with a Permutable Transit Vector
نویسندگان
چکیده
منابع مشابه
An Inapproximability of Transshipment Problems with Permutable Transit Vectors
We investigate the hardness of approximating a transshipment problem with a permutable transit vector. We have already known that the transshipment problem of minimizing the total shipping cost is NP-hard. In this paper, we prove that even if the unit shipping cost associated with every arc is given as a positive integer, there is no polynomial time constant factor approximation algorithm for t...
متن کاملA note on the complexity of the transportation problem with a permutable demand vector
In this note we investigate the computational complexity of the transportation problem with a permutable demand vector, TP-PD for short. In the TP-PD, the goal is to permute the elements of the given integer demand vector b = (b1; : : : ; bn) in order to minimize the overall transportation costs. Meusel and Burkard [4] recently proved that the TP-PD is strongly NP-hard. In their NP-hardness red...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولThe multilocation transshipment problem
We consider a supply chain, which consists of several retailers and one supplier. The retailers, who possibly differ in their cost and demand parameters, may be coordinated through replenishment strategies and transshipments, that is, movement of a product among the locations at the same echelon level. We prove that in order to minimize the expected long-run average cost for this system, an opt...
متن کاملThe Quickest Transshipment Problem
A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is defined by a dynamic network with several sources and sinks; each source has a specified supply and each sink has a specified demand. The problem is to send exactly the right amount of flow out of each source and into each sink in the minimum overall time. Variations of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Mechanical Design, Systems, and Manufacturing
سال: 2010
ISSN: 1881-3054
DOI: 10.1299/jamdsm.4.664